On the b-Stable Set Polytope of Graphs without Bad K4
نویسندگان
چکیده
منابع مشابه
On the b-Stable Set Polytope of Graphs without Bad K4
We prove that for a graph G = (V,E) without bad K4 subdivision, and for b ∈ Z ∪E + , the b-stable set polytope is determined by the system of constraints determined by the vertices, edges and odd circuits. We also prove that this system is totally dual integral. This relates to t-perfect graphs. Let G = (V,E) be a graph and let b ∈ ZV ∪E + . Then a b-stable set in G is a vector x ∈ Z+ satisfyin...
متن کاملOn the Stable Set Polytope of Claw-Free Graphs
In this thesis we focus our attention on the stable set polytope of claw-free graphs. This problem has been open for many years and albeit all the efforts engaged during those last three years, it is still open. This does not mean that no progress has been made and we hope to the contrary that this thesis contains some important advances and that the reader will share this point of view. Unders...
متن کاملColoring planar Toeplitz graphs and the stable set polytope
Cliques and odd cycles are well known to induce facet-de.ning inequalities for the stable set polytope. In graph coloring cliques are a class of n-critical graphs whereas odd cycles represent the class of 3-critical graphs. In the .rst part of this paper we generalize both notions to (Kn \ e)-cycles, a new class of n-critical graphs, and discuss some implications for the class of in.nite planar...
متن کاملOn the stable b-matching polytope
We characterize the bipartite stable b-matching polytope in terms of linear constraints. The stable b-matching polytope is the convex hull of the characteristic vectors of stable b-matchings, that is, of stable assignments of a two-sided multiple partner matching model. Our proof uses the comparability theorem of Roth and Sotomayor [13] and follows a similar line as Rothblum did in [14] for the...
متن کاملOn the facets of the stable set polytope of quasi-line graphs
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximum stable set problem for claw-free graphs, there is even no conjecture at hand today. Such a conjecture exists for the class of quasi-line graphs. This class of graphs is a proper superclass of line g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2003
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480102417343